Simplified Self-Adapting Skip Lists
نویسندگان
چکیده
The Simplified Self-Adapting Skip List, a practical new extension of the Skip List data structure, is designed for use with data that exhibit bias, that is, a nonuniform distribution of queries to set elements. The structure observes an initially unknown degree of bias in queries to a data set and adapts itself to a consistently nearly-optimal configuration, improving search efficiency and speed. By modifying the original Skip List design in intuitive ways, self-optimization is achieved while maintaining an extreme simplicity of description, implementation, and operation unmatched by previous dynamic Skip Lists. The additional memory, time, and conceptual overheads introduced by this structure over the original Skip List are considerably less than in previous dynamic designs, but search speed is comparable or superior, making the SSASL better suited than its predecessors for operations in which time or memory efficiency is critical.
منابع مشابه
A New Weight Balanced Binary Search Tree 1
We develop a new class of weight balanced binary search trees called-balanced binary search trees (-BBSTs).-BBSTs are designed to have reduced internal path length. As a result, they are expected to exhibit good search time characteristics. Individual search, insert, and delete operations in an n node-BBST take O(log n) time for 0 < p 2?1. Experimental results comparing the performance of-BBSTs...
متن کاملDAL: Accommodating Skip Lists in the SDDS Model
We propose DSL, a new Scalable Distributed Data Structure for the dictionary problem, based on a version of Skip Lists, as an alternative to both random trees and deterministic height balanced trees. Our scheme exhibits, with high probability, logarithmic search time, constant reconstruction time, and linear space overhead. Additionally, at the expense of two additional pointers per internal no...
متن کاملBalanced Search Trees Made Simple
As a contribution to the recent debate on simple implementa tions of dictionaries we present new maintenance algorithms for balanced trees In terms of code simplicity our algorithms compare favourably with those for deterministic and probabilistic skip lists
متن کاملSkip Trees, an Alternative Data Structure to Skip Lists in a Concurrent Approach
We present a new type of search trees, called Skip trees, which are a generalization of Skip lists. To be precise, there is a one-to-one mapping between the two data types which commutes with the sequential update algorithms. A Skip list is a data structure used to manage data bases which stores values in a sorted way and in which it is insured that the form of the Skip list is independent of t...
متن کاملOn the Search Path Length of Random Binary Skip Graphs
In this paper we consider the skip graph data structure, a load balancing alternative to skip lists, designed to perform better in a distributed environment. We extend previous results of Devroye on skip lists, and prove that the maximum length of a search path in a random binary skip graph of size n is of order logn with high probability.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010